Whitney (b)-regularity is weaker than Kuo's ratio test for real algebraic stratifications.
نویسندگان
چکیده
منابع مشابه
Globalization Is Weaker Than You Think
From 1980 to 2004, world trade in goods and services increased from 36 percent to 50 percent of world GDP. As the world experienced a surge in the trade of goods and services, it also saw a substantial rise in the trade of financial assets. The share of foreign equities in U.S. investors’ portfolios, for instance, increased from about 1 percent in the early 1980s to 12 percent in 2000.1 On that...
متن کاملCoin Tossing is Weaker than Bit Commitment
We define cryptographic assumptions applicable to two mistrustful parties who each control two or more separate secure sites. We show that, under these assumptions, unconditionally secure coin tossing can be carried out by exchanges of classical information. We show also, following Mayers, Lo and Chau, that unconditionally permanently secure bit commitment cannot be carried out by finitely many...
متن کاملA Geometric Proof of the Existence of Whitney Stratifications
A stratification of a set, e.g. an analytic variety, is, roughly, a partition of it into manifolds so that these manifolds fit together “regularly”. Stratification theory was originated by Thom and Whitney for algebraic and analytic sets. It was one of the key ingredients in Mather’s proof of the topological stability theorem [Ma] (see [GM] and [PW] for the history and further applications of s...
متن کاملUniformity is Weaker than Semi-Uniformity for Some Membrane Systems
We investigate computing models that are presented as families of finite computing devices with a uniformity condition on the entire family. Examples of such models include Boolean circuits, membrane systems, DNA computers, chemical reaction networks and tile assembly systems, and there are many others. However, in such models there are actually two distinct kinds of uniformity condition. The f...
متن کاملMD5 Is Weaker Than Weak: Attacks on Concatenated Combiners
We consider a long standing problem in cryptanalysis: attacks on hash function combiners. In this paper, we propose the first attack that allows collision attacks on combiners with a runtime below the birthday-bound of the smaller compression function. This answers an open question by Joux posed in 2004. As a concrete example we give such an attack on combiners with the widely used hash functio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATHEMATICA SCANDINAVICA
سال: 1979
ISSN: 1903-1807,0025-5521
DOI: 10.7146/math.scand.a-11822